Verification of Compiler Correctness for the WAM
نویسنده
چکیده
Relying on a derivation of the Warren Abstract Machine (WAM) by stepwise reenement of Prolog models by BB orger and Rosen-zweig we present a formalization of an operational semantics for Prolog. Then we develop four reenement steps towards the Warren Abstract Machine (WAM). The correctness and completeness proofs for each step have been elaborated with the theorem prover Isabelle using the logic HOL.
منابع مشابه
Veri cation of Compiler Correctness for the WAM
Relying on a derivation of the Warren Abstract Machine WAM by stepwise re nement of Prolog models by B orger and Rosen zweig we present a formalization of an operational semantics for Prolog Then we develop four re nement steps towards the Warren Abstract Machine WAM The correctness and completeness proofs for each step have been elaborated with the theorem prover Isabelle using the logic HOL
متن کاملGerhard Schellhorn and Wolfgang Ahrendt the Wam Case Study: Verifying Compiler Correctness for Prolog with Kiv
This chapter describes the first half of the formal, machine-supported verification of a Prolog compiler with the KIV system. Our work is based on the mathematical analysis given in (Börger and Rosenzweig, 1995), where an operational semantics (an “interpreter”) for Prolog is defined as an Abstract State Machine (ASM). This interpreter is then transformed in 12 systematic refinements to an ASM ...
متن کاملCorrectness Proof For the WAM with Types
We provide a mathematical speciication of an extension of Warren's Abstract Machine for executing Prolog to type-constraint logic programming and prove its correctness. In this paper, we keep the notion of types and dynamic type constraints rather abstract to allow applications to diierent constraint formalisms like Prolog III or CLP(R). This generality permits us to introduce modular extension...
متن کاملFormal Design of an Abstract Machine for Constraint Logic Programming
By studying properties of CLP over an unspecified constraint domain X one obtains general results applicable to all instances of CLP(X ). The purpose of this paper is to study a general implementation scheme for CLP(X ) by designing a generic extension WAM(X ) of the WAM and a corresponding generic compilation scheme of CLP(X ) programs to WAM(X ) code which is based on Börger and Rosenzweig’s ...
متن کاملA Trust Based Probabilistic Method for Efficient Correctness Verification in Database Outsourcing
Correctness verification of query results is a significant challenge in database outsourcing. Most of the proposed approaches impose high overhead, which makes them impractical in real scenarios. Probabilistic approaches are proposed in order to reduce the computation overhead pertaining to the verification process. In this paper, we use the notion of trust as the basis of our probabilistic app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996